Ela Spectral Characterizations of Propeller Graphs

نویسندگان

  • XIAOGANG LIU
  • SANMING ZHOU
چکیده

Received by the editors on April 17, 2012. Accepted for publication on December 15, 2013. Handling Editor: Xingzhi Zhan. Department of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia ([email protected], [email protected]). Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 27, pp. 19-38, January 2014

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela the Signless Laplacian Spectral Radius of Bicyclic Graphs with a given Girth

Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. In this paper, the graphs in B(n, g) with the largest signless Laplacian spectral radius are characterized.

متن کامل

Ela Variational Characterizations of the Sign-real and the Sign-complex Spectral Radius∗

The sign-real and the sign-complex spectral radius, also called the generalized spectral radius, proved to be an interesting generalization of the classical Perron-Frobenius theory (for nonnegative matrices) to general real and to general complex matrices, respectively. Especially the generalization of the well-known Collatz-Wielandt max-min characterization shows one of the many one-to-one cor...

متن کامل

An Application of Hoffman Graphs for Spectral Characterizations of Graphs

In this paper, we present the first application of Hoffman graphs for spectral characterizations of graphs. In particular, we show that the 2clique extension of the (t+ 1)× (t+ 1)-grid is determined by its spectrum when t is large enough. This result will help to show that the Grassmann graph J2(2D,D) is determined by its intersection numbers as a distance regular graph, if D is large enough.

متن کامل

Ela the Minimum Spectral Radius of Graphs with a given Clique Number∗

In this paper, it is shown that among connected graphs with maximum clique size ω, the minimum value of the spectral radius of adjacency matrix is attained for a kite graph PKn−ω,ω , which consists of a complete graph Kω to a vertex of which a path Pn−ω is attached. For any fixed ω, a small interval to which the spectral radii of kites PKm,ω , m ≥ 1, belong is exhibited.

متن کامل

Ela Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs

Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014